منابع مشابه
The run transform
We consider the transform from sequences to triangular arrays defined in terms of generating functions by f(x) → 1−x 1−xyf (x(1−x) 1−xy ) . We establish a criterion for the transform of a nonnegative sequence to be nonnegative, and we show the transform counts certain classes of lattice paths by number of so-called pyramid ascents and certain classes of partitions into sets of lists (blocks) by...
متن کاملRun - time sensor data Windowed Fourier Transform Principal Components Analysis
This paper describes a diagnostic system for processing high-bandwidth vibration data from distributed sensors for monitoring and diagnosis of electromechanical machines. The system employs time-frequency and principal component analysis techniques to extract and compress features and a Bayesian decision analysis to combine and classify data from multiple sources. Experimental multi-sensor diag...
متن کاملA Faster Implementation of Online Run-Length Burrows-Wheeler Transform
Run-length encoding Burrows-Wheeler Transformed strings, resulting in Run-Length BWT (RLBWT), is a powerful tool for processing highly repetitive strings. We propose a new algorithm for online RLBWT working in run-compressed space, which runs in O(n lg r) time and O(r lgn) bits of space, where n is the length of input string S received so far and r is the number of runs in the BWT of the revers...
متن کاملFrom LZ77 to the Run-Length Encoded Burrows-Wheeler Transform, and Back
The Lempel-Ziv factorization (LZ77) and the Run-Length encoded BurrowsWheeler Transform (RLBWT) are two important tools in text compression and indexing, being their sizes z and r closely related to the amount of text self-repetitiveness. In this paper we consider the problem of converting the two representations into each other within a working space proportional to the input and the output. L...
متن کاملSymbolic computation of the Duggal transform
Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2012
ISSN: 0012-365X
DOI: 10.1016/j.disc.2012.05.009